Computational Adequacy for Substructural Lambda Calculi
نویسندگان
چکیده
منابع مشابه
Bunched Hypersequent Calculi for Distributive Substructural Logics
We introduce a new proof-theoretic framework which enhances the expressive power of bunched sequents by extending them with a hypersequent structure. A general cut-elimination theorem that applies to bunched hypersequent calculi satisfying general rule conditions is then proved. We adapt the methods of transforming axioms into rules to provide cutfree bunched hypersequent calculi for a large cl...
متن کاملCyclic Lambda Calculi
We precisely characterize a class of cyclic lambda-graphs, and then give a sound and complete axiomatization of the terms that represent a given graph. The equational axiom system is an extension of lambda calculus with the letrec construct. In contrast to current theories , which impose restrictions on where the rewriting can take place, our theory is very liberal, e.g., it allows rewriting un...
متن کاملDisjunctive Constraint Lambda Calculi
Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no more than one solution to a set of constraints. We now introduce two forms of Constraint Lambda Calculi which allow for multiple constraint solutions. Moreover the language also permits the use of disjunctions between constrai...
متن کاملFormalized Meta-Theory of Sequent Calculi for Substructural Logics
When studying sequent calculi, proof theorists often have to prove properties about the systems, whether it is to show that they are “well-behaved”, amenable to automated proof search, complete with respect to another system, consistent, among other reasons. These proofs usually involve many very similar cases, which leads to authors rarely writing them in full detail, only pointing to one or t...
متن کاملMachine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi
We present a mechanised formalisation, in Isabelle/HOL, of Brotherston and Goré’s proof of Craig interpolation for a large class display calculi for various propositional substructural logics. Along the way, we discuss the particular difficulties associated with the local interpolation property for various rules, and some important differences between our proofs and those of Brotherston and Gor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2021
ISSN: 2075-2180
DOI: 10.4204/eptcs.333.22